Subspace methods for three‐parameter eigenvalue problems

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

Subspace Correction Methods for Eigenvalue Problems 313

Preconditioned Krylov Subspace Methods for Eigenvalue Problems

Subspace Methods for Large Sparse Interior Eigenvalue Problems

The calculation of a few interior eigenvalues of a matrix has not received much attention in the past, most methods being some spin-off of either the complete eigenvalue calculation or a subspace method designed for the extremal part of the spectrum. The reason for this could be the rather chaotic behaviour of most methods tried. Only 'shift and invert' and polynomial iteration seemed to have a...

a new inexact inverse subspace iteration for generalized eigenvalue problems

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.